Stochastic Chase Decoding of Reed-Solomon Codes
نویسندگان
چکیده
منابع مشابه
Symbolic Stochastic Chase Decoding of Reed-Solomon and BCH Codes
This paper proposes the Symbolic-Stochastic Chase Decoding Algorithm (S-SCA) for the ReedSolomon (RS) and BCH codes. By efficient usage of void space between constellation points for q-ary modulations and using soft information at the input of the decoder, the S-SCA is capable of outperforming conventional Symbolic-Chase algorithm (S-CA) with less computational cost. Since the SSCA starts with ...
متن کاملProgressive algebraic Chase decoding algorithms for Reed-Solomon codes
This study proposes a progressive algebraic Chase decoding (PACD) algorithm for Reed–Solomon (RS) codes. On the basis of the received information, 2 (η > 0) interpolation test-vectors are constructed for the interpolation-based algebraic Chase decoding. A test-vector reliability function is defined to assess their potential for yielding the intended message. The algebraic Chase decoding will th...
متن کاملList Decoding of Reed-Solomon Codes
This master thesis has been written for the completion of the author’s study of mathematics and deals with recent developments in coding theory. In particular, descriptions are given of recent algorithms for generating a list of all words form a Reed–Solomon code that are close to a received word. These algorithms may be adapted so that they can take into account the reliability information of ...
متن کاملMaximum Likelihood Decoding of Reed Solomon Codes
We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F ×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is ...
متن کاملAlgebraic soft-decoding of Reed-Solomon codes
1 Foreword This text is divided in two parts. The first one, the prerequisites, introduces all the necessary concepts of coding theory. If the reader is familiar with the basics of information and coding theory, he might skip this part and go directly to the second part, which is the core of this thesis. This second part studies an algorithm which improves the decoding of Reed-Solomon codes. Fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2010
ISSN: 1089-7798
DOI: 10.1109/lcomm.2010.09.100594